COMPUTATIONAL PROCEDURES FOR OPTIMAL TRANSPORTATION NETWORK PROBLEM
نویسندگان
چکیده
منابع مشابه
Optimal Transportation Problem by Stochastic Optimal Control
We solve optimal transportation problem using stochastic optimal control theory. Indeed, for a super linear cost at most quadratic at infinity, we prove Kantorovich duality theorem by a zero noise limit (or vanishing viscosity) argument.. We also obtain a characterization of the support of an optimal measure in Monge-Kantorovich minimization problem (MKP) as a graph. Our key tool is a duality r...
متن کاملA New Approach for Finding an Optimal Solution for Grey Transportation Problem
In ordinary transportation problems, it is always supposed that the mileage from every source to every destination is a definite number. But in special conditions, such as transporting emergency materials when natural calamity occurs or transporting military supplies during wartime, carrying network may be destroyed, mileage from some sources to some destinations are no longer definite. It is u...
متن کاملThe Monge Optimal Transportation Problem
We report here two recent developments in the theory of optimal transportation. The first is a proof for the existence of optimal mappings to the Monge mass transportation problem [16]. The other is an application of optimal transportation in geometric optics [19]. The optimal transportation problem, in general, deals with the redistribution of materials in the most economical way. The original...
متن کاملDesigning Incomplete Hub Location-routing Network in Urban Transportation Problem
In this paper, a comprehensive model for hub location-routing problem is proposed which no network structure other than connectivity is imposed on backbone (i.e. network between hub nodes) and tributary networks (i.e. networks which connect non-hub nodes to hub nodes). This model is applied in public transportation, telecommunication and banking networks. In this model locating and routing is c...
متن کاملBiological and Shortest-Path Routing Procedures for Transportation Network Design
Background. The design of efficient transportation networks is an important challenge in many research areas. Among the most promising recent methods, biological routing mimic local rules found in nature. However comparisons with other methods are rare. Methods. In this paper we define a common framework to compare network design method. We use it to compare biological and a shortest-path routi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Japan Society of Civil Engineers
سال: 1977
ISSN: 1884-4936,0385-5392
DOI: 10.2208/jscej1969.1977.262_113